Massively parallel transport sweeps on meshes with cyclic dependencies
نویسندگان
چکیده
Abstract When solving the first-order form of linear Boltzmann equation, a common misconception is that matrix-free computational method “sweeping mesh”, used in conjunction with Discrete Ordinates method, too complex or does not scale well enough to be implemented modern high performance computing codes. This has led considerable efforts development matrix-based methods are computationally expensive and partly driven by requirements placed on spatial discretizations. In particular, transport codes required support higher order elements, concept invariably adds lot complexity sweeps because introduction cyclic dependencies curved mesh cells. this article we will present comprehensive implementation sweeping, piecewise-linear DFEM discretization particular focus handling possible extensions These new C++ simulation framework called Chi-Tech ( ? ? T e c h ). We some typical results aspects one can expect during real world simulations, also scaling study >100k processes where maintains greater than 80% efficiency total 87.7 trillion angular flux unknowns for 116 group simulation.
منابع مشابه
Efficient Massively Parallel Transport Sweeps
The full-domain “sweep,” in which all angular fluxes in a problem are calculated given previous-iterate values only for the volumetric source, forms the foundation for many iterative methods that have desirable properties [1]. One important property is that iteration counts do not grow with mesh refinement [1]. The sweep solution on parallel machines is complicated by the dependency of a given ...
متن کاملAn Algorithm for Parallel Sn Sweeps on Unstructured Meshes
We develop a new algorithm for performing parallel Sn sweeps on unstructured meshes. The algorithm uses a low-complexity list ordering heuristic to determine a sweep ordering on any partitioned mesh. For typical problems and with \normal" mesh partitionings we have observed nearly linear speedups on up to 126 processors. This is an important and desirable result, since although analyses of stru...
متن کاملProvably Optimal Parallel Transport Sweeps on Regular Grids
We have found a set of provably optimal algorithms for executing full-domain discrete-ordinate transport sweeps on regular grids in 3D Cartesian geometry. We describe these algorithms and sketch a “proof” that they will always execute the full eight-octant sweep in the minimum possible number of stages for a given Px × Py × Pz partitioning. A stage includes each processor choosing a task to exe...
متن کاملJOSTLE: Partitioning of Unstructured Meshes for Massively Parallel Machines
We outline the philosophy behind a newmethod for solving the graph-partitioning problem which arises in mapping unstructured mesh calculations to parallel computers. The method, encapsulated in a software tool, JOSTLE, employs a combination of techniques including the Greedy algorithm to give an initial partition, together with some powerful optimisation heuristics. A clustering technique is ad...
متن کاملJSweep: A Patch-centric Data-driven Approach for Parallel Sweeps on Large-scale Meshes
In mesh-based numerical simulations, sweep is an important computation pattern. During sweeping a mesh, computations on cells are strictly ordered by data dependencies in given directions. Due to such a serial order, parallelizing sweep is challenging, especially for unstructured and deforming structured meshes. Meanwhile, recent high-fidelity multi-physics simulations of particle transport, in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Physics
سال: 2021
ISSN: ['1090-2716', '0021-9991']
DOI: https://doi.org/10.1016/j.jcp.2020.109892